GTPP: General Truncated Pyramid Peer-to-Peer Architecture over Structured DHT Networks

نویسندگان

  • Zhonghong Ou
  • Erkki Harjula
  • Timo Koskela
  • Mika Ylianttila
چکیده

Abstract— Hierarchical Distributed Hash Table (DHT) architectures have been among the most interesting research topics since the birth of flat DHT architecture. However, most of the previous work has merely focused on the two-tier hierarchy. In this paper, we study and analyze General Truncated Pyramid Peer-to-Peer (GTPP) architecture, the generalized version of Partially Vertical Hierarchical Architecture (PV-HA). The idea is to study whether added tiers of hierarchy can provide added value in performance and functionality. Through mathematical analysis, we demonstrate performance results in comparison to flat architecture, which helps understanding the typical characteristics of hierarchical architectures. Firstly, GTPP has slightly higher expected lookup hop count, although it can be decreased with optimizing the sub-overlay setup. However, GTPP significantly decreases the expected lookup routing latency. Secondly, GTPP has clearer and more reasonable traffic distribution among all the peers from different tiers of sub-overlays, and can work with slightly lower maintenance traffic. Thirdly, our studies indicate that 2-3 tiers are most suitable in most cases for GTPP, considering all the parameters. Keywords—general truncated pyramid peer-to-peer architecture, hierarchical architecture, partially vertical, fully vertical, horizontal, DHT.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hierarchical Structured Peer-to-Peer Networks

Structured peer-to-peer systems or distributed hash tables (DHT) are self-organizing distributed systems designed to support efficient and scalable lookups with dynamic network topology changes. Nodes are organized as structured overlay networks, and data is mapped to nodes in the overlap network based on their identifier. There are two main types of structured peer-to-peer architectures: flat ...

متن کامل

Dynamic Querying in Structured Peer-to-Peer Networks

Dynamic Querying (DQ) is a technique adopted in unstructured Peer-to-Peer (P2P) networks to minimize the number of peers that is necessary to visit to reach the desired number of results. In this paper we introduce the use of the DQ technique in structured P2P networks. In particular, we present a P2P search algorithm, named DQ-DHT (Dynamic Querying over a Distributed Hash Table), to perform DQ...

متن کامل

Hierarchical architectures in structured peer-to-peer overlay networks

Distributed Hash Tables (DHT) are presently used in several large-scale systems in the Internet and envisaged as a key mechanism to provide identifier-locator separation for mobile hosts in Future Internet. Such P2P-based systems become increasingly complex serving popular social networking, resource sharing applications, and Internet-scale infrastructures. Hierarchy is a standard mechanism for...

متن کامل

Semantic Web Services and DHT-based Peer-to-Peer Networks: A New Symbiotic Relationship

In this short position paper, we will describe the intersecting properties of Semantic Web Services (SWS) and DHT-based Peer-to-Peer networks (DHT-P) and then propose an integrated architecture, which utilizes each other’s properties to solve their respective problems. Finally, we go beyond the architecture and list some open issues for effective deployment of such architectures.

متن کامل

Implementing Dynamic Querying Search in k-ary DHT-based Overlays

Distributed Hash Tables (DHTs) provide scalable mechanisms for implementing resource discovery services in structured Peer-to-Peer (P2P) networks. However, DHT-based lookups do not support some types of queries which are fundamental in several classes of applications. A way to support arbitrary queries in structured P2P networks is implementing unstructured search techniques on top of DHT-based...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • MONET

دوره 15  شماره 

صفحات  -

تاریخ انتشار 2010